<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: heap/BinaryHeap.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">heap/BinaryHeap.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * BinaryHeap.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi He</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or</span>
<a name="l00008"></a>00008 <span class="comment"> * modify it under the terms of the GNU Lesser General Public</span>
<a name="l00009"></a>00009 <span class="comment"> * License as published by the Free Software Foundation; either</span>
<a name="l00010"></a>00010 <span class="comment"> * version 2.1 of the License, or (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU</span>
<a name="l00015"></a>00015 <span class="comment"> * Lesser General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __BINARYHEAP_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __BINARYHEAP_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#include &lt;vector&gt;</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;functional&gt;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span><span class="preprocessor">#include &lt;iostream&gt;</span>
<a name="l00028"></a>00028 <span class="preprocessor">#endif </span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="keyword">namespace </span>Heap {
<a name="l00030"></a>00030     <span class="keyword">template</span> &lt;<span class="keyword">class</span> T,<span class="keyword">class</span> Tcontainer = std::vector&lt;T&gt;,<span class="keyword">class</span> _TypeCompare=std::less&lt;T&gt; &gt;
<a name="l00031"></a><a class="code" href="classHeap_1_1BinaryHeap.html">00031</a>     <span class="keyword">class </span><a class="code" href="classHeap_1_1BinaryHeap.html">BinaryHeap</a> {
<a name="l00032"></a>00032         <span class="keyword">inline</span> <span class="keywordtype">int</span> parent(<span class="keywordtype">int</span> idx) {
<a name="l00033"></a>00033             <span class="keywordflow">return</span> ((1+idx)&gt;&gt;1)-1;
<a name="l00034"></a>00034         };
<a name="l00035"></a>00035         <span class="keyword">inline</span> <span class="keywordtype">int</span> left(<span class="keywordtype">int</span> idx) {
<a name="l00036"></a>00036             <span class="keywordflow">return</span> ((idx+1)&lt;&lt;1)-1;
<a name="l00037"></a>00037         };
<a name="l00038"></a>00038         <span class="keyword">inline</span> <span class="keywordtype">int</span> right(<span class="keywordtype">int</span> idx) {
<a name="l00039"></a>00039             <span class="keywordflow">return</span> ((idx+1)&lt;&lt;1);
<a name="l00040"></a>00040         };
<a name="l00041"></a>00041         <span class="keyword">inline</span> <span class="keywordtype">int</span> max(<span class="keywordtype">int</span> i1, <span class="keywordtype">int</span> i2) {
<a name="l00042"></a>00042             <span class="keywordflow">if</span> (i1&lt;=_bottom &amp;&amp; i2&lt;=_bottom) <span class="keywordflow">return</span> _heap[i1] &gt; _heap[i2]? i1 :i2;
<a name="l00043"></a>00043             <span class="keywordflow">else</span> <span class="keywordflow">return</span> i1&lt; i2? i1: i2;
<a name="l00044"></a>00044         };
<a name="l00045"></a>00045         <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(<span class="keywordtype">int</span> i,<span class="keywordtype">int</span> j) {
<a name="l00046"></a>00046             T tmp=_heap[i];
<a name="l00047"></a>00047             _heap[i]=_heap[j];
<a name="l00048"></a>00048             _heap[j]=tmp;
<a name="l00049"></a>00049         };
<a name="l00050"></a>00050         <span class="keyword">inline</span> <span class="keywordtype">void</span> heapfy(<span class="keywordtype">int</span> i) {
<a name="l00051"></a>00051             <span class="keywordtype">int</span> t;
<a name="l00052"></a>00052             <span class="keywordflow">while</span>( left(i) &lt;= _bottom) {
<a name="l00053"></a>00053                 <span class="keywordflow">if</span> (_heap[i] &lt; _heap[t=max(left(i),right(i))]) swap(i,t);
<a name="l00054"></a>00054                 <span class="keywordflow">else</span> <span class="keywordflow">return</span>;
<a name="l00055"></a>00055             }
<a name="l00056"></a>00056         }
<a name="l00057"></a>00057         <span class="keywordtype">int</span> _bottom;
<a name="l00058"></a>00058         Tcontainer _heap;
<a name="l00059"></a>00059         <span class="keyword">public</span>:
<a name="l00060"></a>00060         <a class="code" href="classHeap_1_1BinaryHeap.html">BinaryHeap</a>() {
<a name="l00061"></a>00061             _bottom=-1;
<a name="l00062"></a>00062         };
<a name="l00063"></a>00063         T top() {
<a name="l00064"></a>00064             <span class="keywordflow">return</span> _heap[0];
<a name="l00065"></a>00065         };
<a name="l00066"></a>00066         <span class="keywordtype">void</span> push(T value) {
<a name="l00067"></a>00067             <span class="keywordtype">int</span> i=++_bottom;
<a name="l00068"></a>00068             <span class="keywordtype">int</span> p;
<a name="l00069"></a>00069             _heap[i]=value;
<a name="l00070"></a>00070             <span class="keywordflow">while</span> ( (p=parent(i))&gt;=0 &amp;&amp; _heap[i] &gt; _heap[p]) { <span class="comment">// i greater than p, up heap </span>
<a name="l00071"></a>00071                 swap(i,p);
<a name="l00072"></a>00072                 i=p;
<a name="l00073"></a>00073             }
<a name="l00074"></a>00074 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00075"></a>00075 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Push &quot;</span>&lt;&lt;value&lt;&lt;std::endl;
<a name="l00076"></a>00076             <span class="keywordflow">for</span>(i=0;i&lt;=_bottom;i++) {
<a name="l00077"></a>00077                 std::cout&lt;&lt;_heap[i]&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00078"></a>00078             }
<a name="l00079"></a>00079             std::cout&lt;&lt;std::endl;
<a name="l00080"></a>00080 <span class="preprocessor">#endif</span>
<a name="l00081"></a>00081 <span class="preprocessor"></span>        }
<a name="l00082"></a>00082         T pop() {
<a name="l00083"></a>00083             T value=_heap[0];
<a name="l00084"></a>00084             _heap[0]=_heap[_bottom--];
<a name="l00085"></a>00085             <span class="keywordtype">int</span> i=0;
<a name="l00086"></a>00086             heapfy(i);
<a name="l00087"></a>00087 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00088"></a>00088 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Pop &quot;</span>&lt;&lt;value&lt;&lt;std::endl;
<a name="l00089"></a>00089             <span class="keywordflow">for</span>(i=0;i&lt;=_bottom;i++) {
<a name="l00090"></a>00090                 std::cout&lt;&lt;_heap[i]&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00091"></a>00091             }
<a name="l00092"></a>00092             std::cout&lt;&lt;std::endl;
<a name="l00093"></a>00093 <span class="preprocessor">#endif</span>
<a name="l00094"></a>00094 <span class="preprocessor"></span>        <span class="keywordflow">return</span> value;
<a name="l00095"></a>00095         };
<a name="l00096"></a>00096         <span class="keywordtype">bool</span> empty() {
<a name="l00097"></a>00097            <span class="keywordflow">return</span> _bottom&lt;0 ? <span class="keyword">true</span>:<span class="keyword">false</span>;
<a name="l00098"></a>00098         }
<a name="l00099"></a>00099         <span class="keywordtype">bool</span> append(<span class="keyword">const</span> T* arToAppend,<span class="keyword">const</span> <span class="keywordtype">int</span> nSize) {
<a name="l00100"></a>00100             <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;nSize;i++) push(arToAppend[i]);
<a name="l00101"></a>00101         }
<a name="l00102"></a>00102     };
<a name="l00103"></a>00103 };
<a name="l00104"></a>00104 
<a name="l00105"></a>00105 <span class="preprocessor">#endif </span><span class="comment">/* __BINARYHEAP_H__ */</span>
<a name="l00106"></a>00106 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
